On Anstreicher's combined phase I—phase II projective algorithm for linear programming
نویسندگان
چکیده
منابع مشابه
An O( P Nl)-iteration Combined Phase I-phase Ii Potential Reduction Algorithm for Linear Programming
We show that a modiication of the combined Phase I-Phase II interior-point algorithm for linear programming, due to Anstreicher, de Ghellinck and Vial, Fra-ley, and Todd, terminates in O(p nL) iterations from a suitable initial (interior but infeasible) solution. The algorithm either detects infeasibility, or approaches feasibility and optimality simultaneously, or generates a feasible primal-d...
متن کاملLinear Time Algorithm for Projective Clustering
Projective clustering is a problem with both theoretical and practical importance and has received a great deal of attentions in recent years. Given a set of points P in R space, projective clustering is to find a set F of k lower dimensional j-flats so that the average distance (or squared distance) from points in P to their closest flats is minimized. Existing approaches for this problem are ...
متن کاملA Parametric Approach for Solving Multi-Objective Linear Fractional Programming Phase
In this paper a multi - objective linear fractional programming problem with the fuzzy variables and vector of fuzzy resources is studied and an algorithm based on a parametric approach is proposed. The proposed solving procedure is based on the parametric approach to find the solution, which provides the decision maker with more complete information in line with reality. The simplicity of the ...
متن کاملIncremental Integer Linear Programming for Non-projective Dependency Parsing
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such as non-projective dependency parsing and machine translation, the complete formulation of the decoding problem as an integer linear program renders solving intractable. We present an approach which solves the problem in...
متن کاملLinear Programming II
In the previous lecture, we introduced linear programming using slack form, and we showed how to solve an LP assuming that we have a black box for solving an LP starting from a feasible solution (SimplexInner). In this lecture, we would present SimplexInner. Slack form-a tuple (N, B, A, b, c, v) is an LP. The feasible solution is generated by assigning all the Nonbasic variables the value zero....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1992
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01581187